TSTP Solution File: NUM699^1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : NUM699^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 08:41:57 EDT 2024

% Result   : Theorem 0.16s 0.38s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   36 (  13 unt;  17 typ;   0 def)
%            Number of atoms       :  118 (  15 equ;   0 cnn)
%            Maximal formula atoms :    2 (   6 avg)
%            Number of connectives :   14 (   8   ~;   3   |;   0   &;   0   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   25 (  24   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   19 (  16 usr;   5 con; 0-6 aty)
%            Number of variables   :   20 (   0   ^  14   !;   0   ?;  20   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    nat: $tType ).

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    nat: $tType ).

thf(func_def_1,type,
    x: nat ).

thf(func_def_2,type,
    y: nat ).

thf(func_def_3,type,
    less: nat > nat > $o ).

thf(func_def_5,type,
    lessis: nat > nat > $o ).

thf(func_def_6,type,
    suc: nat > nat ).

thf(func_def_7,type,
    pl: nat > nat > nat ).

thf(func_def_8,type,
    n_1: nat ).

thf(func_def_11,type,
    kCOMB: 
      !>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).

thf(func_def_12,type,
    bCOMB: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).

thf(func_def_13,type,
    vAND: $o > $o > $o ).

thf(func_def_14,type,
    vOR: $o > $o > $o ).

thf(func_def_15,type,
    vIMP: $o > $o > $o ).

thf(func_def_16,type,
    vNOT: $o > $o ).

thf(func_def_17,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(f59,plain,
    $false,
    inference(unit_resulting_resolution,[],[f19,f16,f20]) ).

thf(f20,plain,
    ! [X0: nat,X1: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) != $true )
      | ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,suc,X1)),X0) ) ),
    inference(forward_demodulation,[],[f18,f17]) ).

thf(f17,plain,
    ! [X0: nat] : ( vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),n_1) = vAPP(nat,nat,suc,X0) ),
    inference(cnf_transformation,[],[f3]) ).

thf(f3,axiom,
    ! [X0: nat] : ( vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X0),n_1) = vAPP(nat,nat,suc,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4a) ).

thf(f18,plain,
    ! [X0: nat,X1: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),n_1)),X0) = $true )
      | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) != $true ) ),
    inference(cnf_transformation,[],[f15]) ).

thf(f15,plain,
    ! [X0: nat,X1: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),n_1)),X0) = $true )
      | ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) != $true ) ),
    inference(ennf_transformation,[],[f11]) ).

thf(f11,plain,
    ! [X0: nat,X1: nat] :
      ( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0) = $true )
     => ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),n_1)),X0) = $true ) ),
    inference(fool_elimination,[],[f10]) ).

thf(f10,plain,
    ! [X0: nat,X1: nat] :
      ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0)
     => vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),n_1)),X0) ),
    inference(rectify,[],[f2]) ).

thf(f2,axiom,
    ! [X0: nat,X1: nat] :
      ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,X1),X0)
     => vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,vAPP(nat,sTfun(nat,nat),pl,X1),n_1)),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz25b) ).

thf(f16,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,suc,y)),x) != $true,
    inference(cnf_transformation,[],[f14]) ).

thf(f14,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,suc,y)),x) != $true,
    inference(flattening,[],[f9]) ).

thf(f9,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,suc,y)),x) != $true,
    inference(fool_elimination,[],[f8]) ).

thf(f8,plain,
    ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,suc,y)),x),
    inference(rectify,[],[f5]) ).

thf(f5,negated_conjecture,
    ~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,suc,y)),x),
    inference(negated_conjecture,[],[f4]) ).

thf(f4,conjecture,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,vAPP(nat,nat,suc,y)),x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz25c) ).

thf(f19,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,y),x) = $true,
    inference(cnf_transformation,[],[f13]) ).

thf(f13,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,y),x) = $true,
    inference(fool_elimination,[],[f12]) ).

thf(f12,plain,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,y),x),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),less,y),x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : NUM699^1 : TPTP v8.1.2. Released v3.7.0.
% 0.14/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.36  % Computer : n023.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Fri May  3 14:36:23 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  % (4229)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.38  % (4232)WARNING: value z3 for option sas not known
% 0.16/0.38  % (4231)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.38  % (4230)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.38  % (4232)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.38  % (4235)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.16/0.38  % (4234)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.16/0.38  % (4236)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.16/0.38  % (4233)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.38  % (4236)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.16/0.38  % Exception at run slice level
% 0.16/0.38  User error: % Exception at run slice levelFinite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.38  
% 0.16/0.38  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.38  % Exception at run slice level
% 0.16/0.38  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.38  % (4235)Also succeeded, but the first one will report.
% 0.16/0.38  % (4236)First to succeed.
% 0.16/0.38  % (4234)Also succeeded, but the first one will report.
% 0.16/0.38  % (4236)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4229"
% 0.16/0.38  % (4232)Also succeeded, but the first one will report.
% 0.16/0.38  % (4236)Refutation found. Thanks to Tanya!
% 0.16/0.38  % SZS status Theorem for theBenchmark
% 0.16/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.38  % (4236)------------------------------
% 0.16/0.38  % (4236)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.38  % (4236)Termination reason: Refutation
% 0.16/0.38  
% 0.16/0.38  % (4236)Memory used [KB]: 762
% 0.16/0.38  % (4236)Time elapsed: 0.005 s
% 0.16/0.38  % (4236)Instructions burned: 5 (million)
% 0.16/0.38  % (4229)Success in time 0.02 s
%------------------------------------------------------------------------------